Luca Aceto
Wan Fokkink
Skip Abstract Section
Abstract
Using the left merge and the communication merge from ACP, we present an equational base (i.e., a ground-complete and ω-complete set of valid equations) for the fragment of CCS without recursion, restriction and relabeling modulo (strong) bisimilarity. Our equational base is finite if the set of actions is finite.
- Aceto, L., Fokkink, W. J., Ingolfsdottir, A., and Luttik, B. 2005a. CCS with Hennessy's merge has no finite equational axiomatization. Theoret. Comput. Sci. 330, 3, 377--405. Google Scholar
Digital Library
- Aceto, L., Fokkink, W. J., Ingolfsdottir, A., and Luttik, B. 2005b. Finite equational bases in process algebra: Results and open questions. In Processes, Terms and Cycles: Steps on the Road to Infinity, A. Middeldorp, V. van Oostrom, F. van Raamsdonk, and R. C. de Vrijer, Eds. Lecture Notes in Computer Science, vol. 3838. Springer-Verlag, Berlin, Germany, 338--367. Google ScholarDigital Library
- Baeten, J. C. M. and Bravetti, M. 2005. A ground-complete axiomatization of finite state processes in process algebra. In Proceedings of the 16th International Conference on Concurrency Theory (CONCUR'05), M. Abadi and L. de Alfaro, Eds. Lecture Notes in Computer Science, vol. 3653. Springer-Verlag, Berlin, Germany, 248--262. Google ScholarDigital Library
- Bergstra, J. A. and Klop, J. W. 1984. Process algebra for synchronous communication. Inform. Control 60, 1-3, 109--137.Google ScholarCross Ref
- Bergstra, J. A. and Tucker, J. V. 1985. Top-down design and the algebra of communicating processes. Sci. Comput. Program. 5, 2, 171--199. Google ScholarDigital Library
- Christensen, S., Hirshfeld, Y., and Moller, F. 1994. Decidable subsets of CCS. Comput. J. 37, 4, 233--242.Google ScholarCross Ref
- de Simone, R. 1985. Higher-level synchronising devices in Meije-SCCS. Theoret. Comput. Sci. 37, 245--267.Google ScholarCross Ref
- Groote, J. F. 1990. A new strategy for proving ω-completeness applied to process algebra. In Proceedings of the 2nd International Conference on Concurrency Theory (CONCUR'90), J. C. M. Baeten and J. W. Klop, Eds. Lecture Notes in Computer Science, vol. 458. Springer-Verlag, Berlin, Germany, 314--331. Google ScholarDigital Library
- Heering, J. 1986. Partial evaluation and ω-completeness of algebraic specifications. Theoret. Comput. Sci. 43, 2-3, 149--167. Google ScholarDigital Library
- Hennessy, M. 1988. Axiomatising finite concurrent processes. SIAM J. Comput. 17, 5, 997--1017. Google ScholarDigital Library
- Hennessy, M. and Milner, R. 1985. Algebraic laws for nondeterminism and concurrency. J. ACM 32, 1 (Jan.), 137--161. Google ScholarDigital Library
- Luttik, B. and van Oostrom, V. 2005. Decomposition orders—another proof of the fundamental theorem of arithmetic. Theoret. Comput. Sci. 335, 2--3, 147--186. Google ScholarDigital Library
- Milner, R. 1980. A Calculus of Communicating Systems. Lecture Notes in Computer Science, vol. 92. Springer--Verlag, Berlin, Germany, Google ScholarDigital Library
- Milner, R. 1984. A complete inference system for a class of regular behaviours. J. Comput. Syst. Sci. 28, 3, 439--466.Google ScholarCross Ref
- Milner, R. 1989a. Communication and Concurrency. Prentice-Hall, Englewood Cliffs, NJ. Google ScholarDigital Library
- Milner, R. 1989b. A complete axiomatisation for observational congruence of finite-state behaviors. Inf. Comput. 81, 2, 227--247. Google ScholarDigital Library
- Milner, R. and Moller, F. 1993. Unique decomposition of processes. Theoret. Comput. Sci. 107, 357--363. Google ScholarDigital Library
- Moller, F. 1989. Axioms for concurrency. Ph.D. dissertatish. University of Edinburgh, Edinburgh, UK.Google Scholar
- Moller, F. 1990. The nonexistence of finite axiomatisations for CCS congruences. In Proceedings of the IEEE Symposium on Logic in Computer Science (LICS'90). IEEE Computer Society Press, Los Alamitos, CA, 142--153.Google ScholarCross Ref
- Park, D. M. R. 1981. Concurrency and automata on infinite sequences. In Proceedings of the 5th GI Conference, P. Deussen, Ed. Lecture Notes in Computer Science, vol. 104. Springer-Verlag, Berlin Germany, 167--183. Google ScholarDigital Library
- Sewell, P. 1994. Bisimulation is not finitely (first order) equationally axiomatisable. In Proceedings of the IEEE Symposium on Logic in Computer Science (LICS'94). IEEE Computer Society Press, Los Alamitos, CA, 62--70.Google ScholarCross Ref
- van Tilburg, P. J. A. 2007. Finite equational bases for CCS with restriction. M.S. thesis, Technische Universiteit Eindhoven.Google Scholar
Index Terms
- A finite equational base for CCS with left merge and communication merge
Recommendations
CCS with Hennessy's merge has no finite-equational axiomatization
Expressiveness in concurrencyThis paper confirms a conjecture of Bergstra and Klop's from 1984 by establishing that the process algebra obtained by adding an auxiliary operator proposed by Hennessy in 1981 to the recursion free fragment of Milner's Calculus of Communicating Systems ...
Impossibility Results in the Equational Logic of Processes
This talk offers a survey of negative results on the existence of finite equational axiomatizations for bisimulation equivalence over fragments of algebraic process calculi.
A finite equational base for CCS with left merge and communication merge
ICALP'06: Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part IIUsing the left merge and communication merge from ACP, we present an equational base (i.e., a ground-complete and ω-complete set of valid equations) for the fragment of CCS without restriction and relabelling. Our equational base is finite if the set of ...
Comments